Combinatorial Methods for Integrated Circuits Design

The size and complexity of present day VLSI integrated circuits (IC) and systems demands the elimination of repetitive manual operations and computations in their design. This motivates the development of automatic design systems. Automation of a given (design) process requires its algorithmic analysis. The availability of fast and easily implementable algorithms is essential for the discipline, as heuristic techniques and ad hoc approaches, by themselves, cannot cope with the complexity of current (and future) IC systems. Indeed, IC designers are forced to employ algorithmic techniques and systematic approaches to design fast and reliable VLSI circuits. The objective of this workshop was to bring together researchers whose common grounds are that they have an understanding of algorithm design, combinatorial structures, and graph theory and are interested in VLSI applications. These researchers either have been working on IC design and are applying algorithmic techniques in order to cope with the complexity of VLSI systems. Or they have been working on algorithmic graph theory and combinatorics and have found a new source of problems in VLSI domain. A focus of the workshop was on physical design, since this is the part of IC design that encompasses the most challenging applications of combinatorial algorithms. The purpose of this workshop was to further investigate practical VLSI models, address important and relevant issues, and to apply recent developments in algorithm design and combinatorial structures to VLSI problems. One goal was to develop models that accurately practical practical issues and thus generalize some of the models currently being used. Corresponding problems need to be formulated without sacrificing their realistic nature. During the workshop 25 lectures have been presented by the participants from different European countries, U.S.A., Japan, Taiwan and Korea. The lectures covered various topics from graph algorithms and combinatorics, e.g. Steiner trees and disjoint paths problems, cut and partitioning prob-